Dynamic Deterministic Pattern-Matching
نویسندگان
چکیده
منابع مشابه
Oscillatory Dynamic Link Matching for Pattern Recognition
The ”dynamic link matching” (DLM) has been first proposed by Konen et al. [1] to solve the visual correspondence problem. The approach consists of two layers of neurons connected to each other through synaptic connections constrained to some normalization. The reference pattern is applied to one of the layers and the pattern to be recognized to the other. The dynamics of the neurons are chosen ...
متن کاملGraph Pattern Matching for Dynamic Team Formation
Finding a list of k teams of experts, referred to as top-k team formation, with the required skills and high collaboration compatibility has been extensively studied. However, existing methods have not considered the specific collaboration relationships among different team members, i.e., structural constraints, which are typically needed in practice. In this study, we first propose a novel gra...
متن کاملDynamic and Approximate Pattern Matching in 2D
We consider dynamic and online variants of 2D pattern matching between an m×m pattern and an n× n text. All the algorithms we give are randomised and give correct outputs with at least constant probability. – For dynamic 2D exact matching where updates change individual symbols in the text, we show updates can be performed in O(log n) time and queries in O(log m) time. – We then consider a mode...
متن کاملA deterministic dynamic element matching approach to ADC testing
A deterministic dynamic element matching (DEM) approach to ADC testing is introduced and compared with a common random DEM method. With both approaches, a highly non-ideal DAC is used to generate an excitation for a DUT that has linearity that far exceeds that of the test stimulus. Simulation results show that both methods can be used for testing of ADCs but with a substantial reduction in the ...
متن کاملDeterministic Fully Dynamic Data Structures for Vertex Cover and Matching
We present the first deterministic data structures for maintaining approximate minimum vertex cover and maximum matching in a fully dynamic graph G = (V,E), with |V | = n and |E| = m, in o( √ m ) time per update. In particular, for minimum vertex cover we provide deterministic data structures for maintaining a (2+ ) approximation inO(log n/ ) amortized time per update. For maximum matching, we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2000
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80335-4